Generalizing the duality theorem of graph embeddings
نویسندگان
چکیده
منابع مشابه
On self duality of pathwidth in polyhedral graph embeddings
Let G be a 3-connected planar graph and G∗ be its dual. We show that the pathwidth of G∗ is at most 6 times the pathwidth of G. We prove this result by relating the pathwidth of a graph with the cut-width of its medial graph and we extend it to bounded genus embeddings. We also show that there exist 3-connected planar graphs such that the pathwidth of such a graph is at least 1.5 times the path...
متن کاملGeneralizing the Coleman Hill Theorem
Following the work of Khare et al, we show that the generalization to systems with spontaneous symmetry breaking of the Coleman-Hill theorem to one-loop order, can be extended to the case including fermions with the most general interactions. Although the correction to the parity-odd part of the vacuum polarization looks complicated in the Higgs phase, it turns out that the correction to the Ch...
متن کاملGeneralizing Hartogs’ Trichotomy Theorem
The Trichotomy Principle says that a pair of sets A and B either admits a bijection or else precisely one of these sets injects into the other. Hartogs established logical equivalence between the Trichotomy Principle and the Well-Ordering Principle. As ZF suffices to prove the Schröder-Bernstein theorem, the heart of Trichotomy lies in the existence of some injection connecting A and B (in eith...
متن کاملA 5 Curve Theorem Generalizing the Theorem of Carnot
Because of the 2-dimensionality of the plane a relation holds between any 3 quantities determining a point or a line. The relation between the meets of a line with the sides of a fixed triangle is given by the theorem of Menelaos. This is generalized to the meets of an algebraic curve with a triangle by the theorem of Carnot. I give here a further generalization to the meets of an algebraic cur...
متن کاملGap forcing: Generalizing the Lévy-Solovay theorem
The Levy-Solovay Theorem [LevSol67] limits the kind of large cardinal embeddings that can exist in a small forcing extension. Here I announce a generalization of this theorem to a broad new class of forcing notions. One consequence is that many of the forcing iterations most commonly found in the large cardinal literature create no new weakly compact cardinals, measurable cardinals, strong card...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1989
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90156-8